Column Generation-based Heuristics for Vehicle Routing Problem with Soft Time Windows
نویسندگان
چکیده
This paper presents a column generation-based heuristics for the Vehicle Routing and scheduling Problem with Soft Time Windows (VRPSTW). The subproblem has been solved using a modified stochastic push forward insertion heuristics that incorporates the early and late arrival penalties. The useful dual information (shadow prices) from the column generation master problem guides the heuristic subproblem to provide negative reduced cost columns of sufficient quality. The performance of column generation-based heuristics is evaluated comparing its results with a genetic algorithms heuristics whose initial population is based on the same insertion heuristics as used in the column generation subproblem. The results showed that the column generation-based heuristics produced better quality solutions, both in terms of cost and environment (CO2), in most cases in only quarter of the computation time, on average.
منابع مشابه
Acceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملA multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملA goal programming model for vehicle routing problem with backhauls and soft time windows
The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...
متن کاملHybrid Insertion Heuristics for Vehicle Routing Problem with Soft Time Windows
Industrial growth and expanding employment opportunities have led to the urban-oriented economic development in many countries. Demand of transportation, both in terms of passengers as well as for freight is also increasing in and around these big urban conurbations. A high proportion of total goods movement occurs within cities 1) , and most of this movement is based on road transport. Traffic...
متن کاملA Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Single-sided Time Window Setting
Customer service level is of prime importance in today competitive world and has various dimensions with delivery quality being one of the most important ones. Delivery quality has several parameters such as deliver time window options, time window size, etc. In this paper we focus on one of these parameters, namely time window setting. It has a direct impact upon customer satisfaction and busi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010